Identifying Structural Mechanisms in Standard Genetic Programming
نویسندگان
چکیده
This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an unintended consequence of using trees as information structures. A model is described that predicts outcomes in GP that would arise solely from such mechanisms. Comparisons with empirical results from GP lend support to the existence of these mechanisms.
منابع مشابه
GENETIC PROGRAMMING AND MULTIVARIATE ADAPTIVE REGRESION SPLINES FOR PRIDICTION OF BRIDGE RISKS AND COMPARISION OF PERFORMANCES
In this paper, two different data driven models, genetic programming (GP) and multivariate adoptive regression splines (MARS), have been adopted to create the models for prediction of bridge risk score. Input parameters of bridge risks consists of safe risk rating (SRR), functional risk rating (FRR), sustainability risk rating (SUR), environmental risk rating (ERR) and target output. The total ...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملDynamic environments can speed up evolution with Genetic Programming Technical Report UCD-CSI-2011-03
We present a study of dynamic environments with genetic programming to ascertain if a dynamic environment can speed up evolution when compared to an equivalent static environment. We present an analysis of the types of dynamic variation which can occur with a variable-length representation such as adopted in genetic programming identifying modular varying, structural varying and incremental var...
متن کاملTwo-Step Genetic Programming for Optimization of RNA Common-Structure
We present an algorithm for identifying putative non-coding RNA (ncRNA) using an RCSG (RNA Common-Structural Grammar) and show the effectiveness of the algorithm. The algorithm consists of two steps: structure learning step and sequence learning step. Both steps are based on genetic programming. Generally, genetic programming has been applied to learning programs automatically, reconstructing n...
متن کامل